Common due date scheduling with autonomous and induced learning
نویسندگان
چکیده
منابع مشابه
Common due date scheduling with autonomous and induced learning
Yet, the few existing models considering learning effects in scheduling concentrate on learning-by-doing (autonomous learning). But recent contributions to the literature on learning in manufacturing organizations emphasize the important impact of proactive investments in technological knowledge on the learning rate (induced learning). In the present paper, we focus on a scheduling problem wher...
متن کاملStochastic Single Machine Scheduling with Random Common Due Date
This paper studies the single machine scheduling problem for minimizing the expected total weighted deviations of completion times from random common due date. Jobs have exponentially distributed processing times and the common due date is a generalized Erlang distribution. The optimal schedules are shown to be ⁄-shaped. Moreover, we give the optimal schedules when the machine is subject to sto...
متن کاملA Column Generation Algorithm for Common Due Date Scheduling
We consider the single-machine problem of scheduling n jobs to minimize the total weighted deviation from a given common due date, where the weights for early and tardy completion are asymmetric. First, we assume that the common due date is large. We formulate this problem as an integer linear program with an exponential number of variables and present a column generation algorithm to solve e c...
متن کاملGenetic Algorithms for Single Machine Job Scheduling with Common Due Date and Symmetric Penalties
A single machine n-job scheduling problem is examined to minimize sum of absolute deviations of completion times from a common due date. Simple and hybrid genetic Algorithms are developed by investigating basic operators for the applications of job sequencing problems. For the simple genetic algorithm two heuristic crossover schemes: Algorithm VASX and Algorithm VADX are developed based on impo...
متن کاملScheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
The just-in-time production philosophy has led to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single machine problems. In the case of multi-machine problems, there are some papers dealing with parallel machine problems. However, for multi-operation sched...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2003.06.001